package com.mzy;

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int T = scanner.nextInt();
        while (T-- > 0) {
            int n = scanner.nextInt();
            int[] heights = new int[n];
            for (int i = 0; i < n; i++) {
                heights[i] = scanner.nextInt();
            }
            int result = findMaxIncreasingLength(n, heights);
            System.out.println(result);
        }
        scanner.close();
    }

    private static int findMaxIncreasingLength(int n, int[] heights) {
        if (n == 0) {
            return 0;
        }
        int[] left = new int[n];
        int[] right = new int[n];

        for (int i = 0; i < n; i++) {
            left[i] = 1;
            right[i] = 1;
        }
        for (int i = 1; i < n; i++) {
            if (heights[i] > heights[i - 1]) {
                left[i] = left[i - 1] + 1;
            }
        }

        for (int i = n - 2; i >= 0; i--) {
            if (heights[i] < heights[i + 1]) {
                right[i] = right[i + 1] + 1;
            }
        }
        int maxLength = 0;

        for (int i = 0; i < n; i++) {
            int leftPart = (i > 0) ? left[i - 1] : 0;
            int rightPart = (i < n - 1) ? right[i + 1] : 0;
            maxLength = Math.max(maxLength, leftPart + rightPart);
        }
        return Math.max(maxLength, Math.max(left[n - 1], right[0]));
    }
}
